Iterative multiuser joint decoding: Unified framework and asymptotic analysis

نویسندگان

  • Joseph Jean Boutros
  • Giuseppe Caire
چکیده

We present a framework for iterative multiuser joint decoding of code-division multiple-access (CDMA) signals, based on the factor-graph representation and on the sum-product algorithm. In this framework, known parallel and serial, hard and soft interference cancellation algorithms are derived in a unified way. The asymptotic performance of these algorithms in the limit of large code block length can be rigorously analyzed by using density evolution. We show that, for random spreading in the large-system limit, density evolution is considerably simplified. Moreover, by making a Gaussian approximation of the decoder soft output, we show that the behavior of iterative multiuser joint decoding is approximately characterized by the stable fixed points of a simple one-dimensional nonlinear dynamical system.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative Multiuser Joint Decoding: Uni ed Framework and Asymptotic Analysis

We present a framework for iterative multiuser joint decoding based on the application of the sum-product algorithm to the factor graph representation of the a posteriori joint probability mass function of the users information bits. Several low-complexity algorithms previously proposed based on parallel and serial hard and soft interference cancellation are derived in a simple and uni ed way. ...

متن کامل

Density Evolution and Power Profile Optimization for Iterative Multiuser Decoders Based on Individually Optimum Multiuser Detectors

Iterative multiuser joint decoding based on exact Belief Propagation (BP) is analyzed in the large system limit by means of the replica method. It is shown that performance can be improved by appropriate power assignment to the users. The optimum power assignment can be found by linear programming in most technically relevant cases. The performance of BP iterative multiuser joint decoding is co...

متن کامل

Design and performance of a low-complexity iterative multiuser joint decoder based on Viterbi decoding and parallel interference cancellation

We propose a low complexity multiuser joint Parallel Interference Cancellation (PIC) decoder for Direct-Sequence CDMA. An estimate of the Multiple-Access Interference (MAI) signal is formed by weighting the hard decisions produced by hard-output Viterbi decoders. Such MAI interference estimate is subtracted from the received signal in order to improve decoding in the next iteration. By using as...

متن کامل

Convergence analysis for iterative multiuser decoding

We investigate a sub-optimal reduced-complexity iterative technique for joint detection and estimation for sets of constrained sequences and derive analytical results concerning convergence regions and fixed points. We apply this theory to the problem of multiple-user decoding.

متن کامل

Optimum asymptotic multiuser efficiency of randomly spread CDMA

Analysis and design of trellis codes optimized for a binary symmetric markov source with maximum a posteriori detection , " IEEE Trans. , " Source-channel optimized trellis codes for bitonal image transmission over AWGN channels, " IEEE Trans. [20] P. J. Lee, " Computation of bit error rate of coherent M-ary PSK with gray code bit mapping, " IEEE Trans. A unified approach to the performance ana...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2002